Lecture 11: Excellence implies Categoricity: A
نویسنده
چکیده
The following assertion is an exercise in Lecture 4. Let ψ be a complete sentence in Lω1,ω in a countable language L. Then there is a countable language L ′ extending L and a first order L′-theory T such that reduct is a 1-1 map from the atomic models of T onto the models of ψ. So in particular, any complete sentence of Lω1,ω can be replaced (for spectrum purposes) by considering the atomic models of a first order theory. This section is indirectly based on [?, ?, ?], where most of the results were originally proved. But our exposition owes a great deal to [?, ?, ?]. Recall that a model M is atomic if every finite sequence in M realizes a principal type over the empty set. Thus if T is א0-categorical every model of T is atomic.
منابع مشابه
Abstract Elementary Classes Motivations and Directions
Elementary Classes Motivations and Directions John T. Baldwin Why AEC? Categoricity and Complex Exponentiation Excellence– Generalized Amalgamation Eventual Categoricity Core Mathematics again Abstract Elementary Classes Motivations and Directions
متن کاملLecture 4: Categoricity implies Completeness
In first order logic, the theory of a structure is a well-defined object; here such a theory is not so clearly specified. An infinite conjunction of first order sentences behaves very much like a single sentence; in particular it satisfies both the upward and downward Löwenheim Skolem theorems. In contrast, the conjunction of all Lω1,ω true in an uncountable model may not have a countable model...
متن کاملUnstable Classes of Metric Structures
We prove a strong nonstructure theorem for a class of metric structures with an unstable formula. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several weak versions of stability. This is the first step in the direction of the investigation of weak categoricity of metric classes.
متن کاملAn Introduction to Excellent Classes
In this paper, we present Shelah’s theory of excellence concluding with his categoricity theorem for the class of atomic models of a countable first order theory, under the assumption that there exists a large full model. This allows us to do the entire work within ZFC and without any assumption on the number of models of size א1, in contrast to Shelah’s original treatment.
متن کاملCategorical characterizations of the natural numbers require primitive recursion
Simpson and Yokoyama [Ann. Pure Appl. Logic 164 (2012), 284–293] asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA0. We answer in the negative, showing that for any characterization of the natural numbers which is provably true in WKL0, the categoricity theorem implies Σ1 induction. On the other hand, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003